________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:26:50
Input Data from:  dataset158.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,165
Average f[i]   :4550
Average g[i,j] :2009,80392156863
Total demand   :10460
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	3040	1	-1	4	5500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3040


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 52
> Selected Move:	4640	1	-1	16	12000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0    >new incumb.: 4640


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 80
> Selected Move:	5530	1	-1	15	17000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0    >new incumb.: 5530


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 87
> Selected Move:	6600	1	-1	18	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0    >new incumb.: 6600


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 77
> Selected Move:	6710	3	0	14	25100


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 56
> Selected Move:	6760	4	14	4	24300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  0  0  0  1  1  1  0  1  0    >new incumb.: 6760


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 61
> Selected Move:	6760	4	4	15	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 55
> Selected Move:	6760	4	15	16	23500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 66
> Selected Move:	6760	4	16	18	23500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 76
> Selected Move:	6750	3	18	19	23900


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 65
> Selected Move:	6750	4	19	4	22800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 70
> Selected Move:	6750	4	4	14	23600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  2  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 65
> Selected Move:	6750	4	14	15	23500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 64
> Selected Move:	6750	4	15	16	22000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 72
> Selected Move:	6670	3	1	5	24400


> New Y[]: 
	
	 0  0  4  0  1  3  0  0  0  0  0  0  0  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 66
> Selected Move:	6670	4	5	4	23500


> New Y[]: 
	
	 0  0  4  0  3  1  0  0  0  0  0  0  0  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 70
> Selected Move:	6760	3	19	18	25000


> New Y[]: 
	
	 0  0  4  0  3  1  0  0  0  0  0  0  0  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 56
> Selected Move:	6760	4	4	16	24600


> New Y[]: 
	
	 0  0  4  0  2  1  0  0  0  0  0  0  0  0  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 58
> Selected Move:	6760	4	4	5	24900


> New Y[]: 
	
	 0  0  4  0  1  2  0  0  0  0  0  0  0  0  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 57
> Selected Move:	6760	4	5	18	23800


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  1  3  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 65
> Selected Move:	6760	4	16	4	25000


> New Y[]: 
	
	 0  0  4  0  3  1  0  0  0  0  0  0  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 56
> Selected Move:	6760	4	4	18	24500


> New Y[]: 
	
	 0  0  4  0  2  1  0  0  0  0  0  0  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 60
> Selected Move:	6760	4	4	5	24800


> New Y[]: 
	
	 0  0  4  0  1  2  0  0  0  0  0  0  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 58
> Selected Move:	6760	4	5	16	23700


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  1  2  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 65
> Selected Move:	6678	4	16	15	25200


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  2  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 56
> Selected Move:	6650	3	16	19	23700


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  2  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 64
> Selected Move:	6670	3	18	16	23800


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  2  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 69
> Selected Move:	6670	4	15	4	23100


> New Y[]: 
	
	 0  0  4  0  2  1  0  0  0  0  0  0  0  0  1  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 69
> Selected Move:	6670	4	4	5	23400


> New Y[]: 
	
	 0  0  4  0  1  2  0  0  0  0  0  0  0  0  1  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 68
> Selected Move:	6750	3	5	0	21800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 87
> Selected Move:	6760	3	19	18	23300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 80
> Selected Move:	6760	4	16	4	24500


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 76
> Selected Move:	6760	4	4	18	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 81
> Selected Move:	6750	3	18	19	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 82
> Selected Move:	6750	4	19	4	23000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 81
> Selected Move:	6750	4	4	14	23600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 79
> Selected Move:	6750	4	14	15	23600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 78
> Selected Move:	6726	3	19	18	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 68
> Selected Move:	6726	4	15	14	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 80
> Selected Move:	6640	3	16	19	23600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  3  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 79
> Selected Move:	6660	3	15	11	22600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 83
> Selected Move:	6660	4	14	4	22000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 87
> Selected Move:	6710	1	-1	9	26000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  1  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 44
> Selected Move:	7030	4	4	18	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  3  1    >new incumb.: 7030


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 64
> Selected Move:	7120	3	14	10	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0  3  1    >new incumb.: 7120


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 58
> Selected Move:	7119	3	9	12	25200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  1  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 75
> Selected Move:	7030	3	10	14	25200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 47 #######################


> Neighbours evaluated; 87
> Selected Move:	6967	3	12	15	25700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  1  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 48 #######################


> Neighbours evaluated; 74
> Selected Move:	6983	3	14	10	25700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 49 #######################


> Neighbours evaluated; 68
> Selected Move:	6952	3	11	12	26200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 50 #######################


> Neighbours evaluated; 81
> Selected Move:	6870	3	18	1	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 51 #######################


> Neighbours evaluated; 87
> Selected Move:	7090	3	10	14	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 52 #######################


> Neighbours evaluated; 105
> Selected Move:	6895	3	14	18	26500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 53 #######################


> Neighbours evaluated; 71
> Selected Move:	6883	3	15	9	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 54 #######################


> Neighbours evaluated; 84
> Selected Move:	6990	3	12	14	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 55 #######################


> Neighbours evaluated; 84
> Selected Move:	7058	3	18	16	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 56 #######################


> Neighbours evaluated; 98
> Selected Move:	6835	3	14	10	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 57 #######################


> Neighbours evaluated; 94
> Selected Move:	6800	3	10	11	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 58 #######################


> Neighbours evaluated; 91
> Selected Move:	6800	3	16	18	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 59 #######################


> Neighbours evaluated; 73
> Selected Move:	6768	3	9	12	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 60 #######################


> Neighbours evaluated; 75
> Selected Move:	6755	3	12	14	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 61 #######################


> Neighbours evaluated; 53
> Selected Move:	6770	4	0	4	21800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 62 #######################


> Neighbours evaluated; 51
> Selected Move:	6770	4	4	11	23900


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  2  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 63 #######################


> Neighbours evaluated; 40
> Selected Move:	6770	4	11	14	22600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 64 #######################


> Neighbours evaluated; 48
> Selected Move:	6770	4	14	18	21000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 65 #######################


> Neighbours evaluated; 50
> Selected Move:	7030	1	-1	9	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 66 #######################


> Neighbours evaluated; 42
> Selected Move:	6900	3	9	12	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 67 #######################


> Neighbours evaluated; 51
> Selected Move:	6885	3	12	15	26000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 68 #######################


> Neighbours evaluated; 49
> Selected Move:	6695	3	15	10	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 69 #######################


> Neighbours evaluated; 39
> Selected Move:	6773	3	14	12	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  1  1  1  0  0  0  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 70 #######################


> Neighbours evaluated; 39
> Selected Move:	6760	3	11	15	26500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 71 #######################


> Neighbours evaluated; 39
> Selected Move:	6663	3	10	14	26500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 72 #######################


> Neighbours evaluated; 68
> Selected Move:	6660	2	12	-1	22000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 73 #######################


> Neighbours evaluated; 70
> Selected Move:	6660	4	18	4	22800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 74 #######################


> Neighbours evaluated; 66
> Selected Move:	6660	4	4	14	23600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 75 #######################


> Neighbours evaluated; 63
> Selected Move:	6660	4	14	15	23500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 76 #######################


> Neighbours evaluated; 61
> Selected Move:	6660	4	15	19	23900


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 77 #######################


> Neighbours evaluated; 69
> Selected Move:	6770	3	15	11	22900


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 78 #######################


> Neighbours evaluated; 49
> Selected Move:	6610	3	2	6	24900


> New Y[]: 
	
	 0  3  0  0  1  0  4  0  0  0  0  1  0  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 79 #######################


> Neighbours evaluated; 28
> Selected Move:	6610	4	6	4	25000


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  0  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 80 #######################


> Neighbours evaluated; 28
> Selected Move:	6610	4	4	18	24700


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  4  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 81 #######################


> Neighbours evaluated; 31
> Selected Move:	6610	4	18	19	24100


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  2  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 82 #######################


> Neighbours evaluated; 33
> Selected Move:	6610	4	18	4	24900


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  0  0  0  1  0  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 83 #######################


> Neighbours evaluated; 25
> Selected Move:	6610	4	4	6	24400


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  0  0  0  1  0  0  1  0  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 84 #######################


> Neighbours evaluated; 30
> Selected Move:	6610	4	19	4	23400


> New Y[]: 
	
	 0  3  0  0  4  0  2  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 85 #######################


> Neighbours evaluated; 38
> Selected Move:	6610	4	4	6	23800


> New Y[]: 
	
	 0  3  0  0  2  0  4  0  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 86 #######################


> Neighbours evaluated; 33
> Selected Move:	6610	4	4	14	24600


> New Y[]: 
	
	 0  3  0  0  1  0  4  0  0  0  0  1  0  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 87 #######################


> Neighbours evaluated; 30
> Selected Move:	6610	4	6	4	24700


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  0  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 88 #######################


> Neighbours evaluated; 29
> Selected Move:	6610	4	4	14	24900


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  0  0  0  1  0  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 89 #######################


> Neighbours evaluated; 24
> Selected Move:	6610	4	4	6	24400


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  0  0  0  1  0  0  4  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 90 #######################


> Neighbours evaluated; 28
> Selected Move:	6610	4	6	18	24100


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  1  0  0  4  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 91 #######################


> Neighbours evaluated; 32
> Selected Move:	6610	4	14	4	23100


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  1  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 92 #######################


> Neighbours evaluated; 40
> Selected Move:	6610	4	4	6	23000


> New Y[]: 
	
	 0  3  0  0  1  0  4  0  0  0  0  1  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 93 #######################


> Neighbours evaluated; 40
> Selected Move:	6610	4	6	18	23100


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  0  0  0  1  0  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 94 #######################


> Neighbours evaluated; 40
> Selected Move:	6610	4	6	4	23600


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  0  0  0  1  0  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 95 #######################


> Neighbours evaluated; 32
> Selected Move:	6610	4	4	14	24400


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  1  0  0  2  0  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 96 #######################


> Neighbours evaluated; 41
> Selected Move:	6422	3	11	15	25400


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  0  0  0  2  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 97 #######################


> Neighbours evaluated; 33
> Selected Move:	6610	3	6	7	24900


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  0  0  2  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 98 #######################


> Neighbours evaluated; 46
> Selected Move:	6610	4	14	4	24100


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  0  0  0  0  0  0  1  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 99 #######################


> Neighbours evaluated; 52
> Selected Move:	6610	4	4	7	23900


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  0  0  0  1  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 100 #######################


> Neighbours evaluated; 52
> Selected Move:	6610	4	7	15	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  0  0  1  2  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 101 #######################


> Neighbours evaluated; 45
> Selected Move:	6610	4	15	18	24700


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  0  0  1  4  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 102 #######################


> Neighbours evaluated; 46
> Selected Move:	6610	4	15	4	23600


> New Y[]: 
	
	 0  3  0  0  4  0  0  1  0  0  0  0  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 103 #######################


> Neighbours evaluated; 55
> Selected Move:	6610	4	4	7	24300


> New Y[]: 
	
	 0  3  0  0  1  0  0  4  0  0  0  0  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 104 #######################


> Neighbours evaluated; 48
> Selected Move:	6610	4	7	14	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  0  0  4  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 105 #######################


> Neighbours evaluated; 44
> Selected Move:	6610	4	14	19	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  0  0  1  1  0  0  2  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 106 #######################


> Neighbours evaluated; 52
> Selected Move:	6556	4	18	7	25200


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  0  0  0  1  1  0  0  1  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 107 #######################


> Neighbours evaluated; 44
> Selected Move:	6610	4	19	4	24200


> New Y[]: 
	
	 0  3  0  0  4  0  0  2  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 108 #######################


> Neighbours evaluated; 52
> Selected Move:	6584	4	4	7	25100


> New Y[]: 
	
	 0  3  0  0  2  0  0  4  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 109 #######################


> Neighbours evaluated; 46
> Selected Move:	6550	3	7	6	24800


> New Y[]: 
	
	 0  3  0  0  2  0  4  0  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 110 #######################


> Neighbours evaluated; 47
> Selected Move:	6550	4	4	6	24400


> New Y[]: 
	
	 0  3  0  0  4  0  2  0  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 111 #######################


> Neighbours evaluated; 48
> Selected Move:	6550	4	4	18	24100


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  0  0  0  0  0  0  1  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 112 #######################


> Neighbours evaluated; 51
> Selected Move:	6550	4	6	4	24600


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  0  0  0  0  0  0  1  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 113 #######################


> Neighbours evaluated; 48
> Selected Move:	6550	4	4	18	24100


> New Y[]: 
	
	 0  3  0  0  4  0  1  0  0  0  0  0  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 114 #######################


> Neighbours evaluated; 52
> Selected Move:	6550	4	4	6	24000


> New Y[]: 
	
	 0  3  0  0  1  0  4  0  0  0  0  0  0  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 115 #######################


> Neighbours evaluated; 52
> Selected Move:	6528	4	6	14	25100


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  0  0  0  4  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 116 #######################


> Neighbours evaluated; 43
> Selected Move:	6528	4	14	19	25100


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  0  2  4 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 117 #######################


> Neighbours evaluated; 47
> Selected Move:	6507	4	19	15	25200


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  0  0  0  1  4  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 118 #######################


> Neighbours evaluated; 45
> Selected Move:	6547	3	15	11	25300


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  0  0  4  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 119 #######################


> Neighbours evaluated; 37
> Selected Move:	6487	4	18	6	25600


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  0  0  0  4  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 120 #######################


> Neighbours evaluated; 36
> Selected Move:	6445	3	11	15	25500


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  0  0  0  0  0  0  1  4  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 121 #######################


> Neighbours evaluated; 43
> Selected Move:	6546	3	6	7	25300


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  0  0  0  1  4  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 122 #######################


> Neighbours evaluated; 43
> Selected Move:	6566	4	15	14	25200


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  0  0  0  4  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 123 #######################


> Neighbours evaluated; 49
> Selected Move:	6520	4	7	4	25400


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  0  0  0  0  0  0  4  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 124 #######################


> Neighbours evaluated; 45
> Selected Move:	6564	4	4	14	25200


> New Y[]: 
	
	 0  3  0  0  4  0  0  1  0  0  0  0  0  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 125 #######################


> Neighbours evaluated; 45
> Selected Move:	6587	4	14	15	25100


> New Y[]: 
	
	 0  3  0  0  4  0  0  1  0  0  0  0  0  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 126 #######################


> Neighbours evaluated; 55
> Selected Move:	6500	3	7	12	24100


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  0  0  0  0  1  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 127 #######################


> Neighbours evaluated; 62
> Selected Move:	6500	4	4	12	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  4  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 128 #######################


> Neighbours evaluated; 52
> Selected Move:	6500	4	12	18	23800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  1  0  1  2  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 129 #######################


> Neighbours evaluated; 63
> Selected Move:	6500	4	15	4	23100


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  0  0  0  1  0  1  1  0  0  4  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 130 #######################


> Neighbours evaluated; 65
> Selected Move:	6550	3	19	3	24600


> New Y[]: 
	
	 0  3  0  1  2  0  0  0  0  0  0  0  1  0  1  1  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 131 #######################


> Neighbours evaluated; 63
> Selected Move:	6550	4	4	3	23300


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  0  1  0  1  1  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 132 #######################


> Neighbours evaluated; 76
> Selected Move:	6550	4	3	18	23800


> New Y[]: 
	
	 0  3  0  4  1  0  0  0  0  0  0  0  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 133 #######################


> Neighbours evaluated; 70
> Selected Move:	6550	4	3	4	24100


> New Y[]: 
	
	 0  3  0  1  4  0  0  0  0  0  0  0  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 134 #######################


> Neighbours evaluated; 69
> Selected Move:	6550	4	4	12	25000


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  4  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 135 #######################


> Neighbours evaluated; 60
> Selected Move:	6570	3	12	2	23500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  0  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 136 #######################


> Neighbours evaluated; 92
> Selected Move:	6600	3	18	16	23500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  0  0  1  1  2  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 137 #######################


> Neighbours evaluated; 90
> Selected Move:	6600	4	16	3	23000


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 138 #######################


> Neighbours evaluated; 91
> Selected Move:	6600	4	3	4	24300


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 139 #######################


> Neighbours evaluated; 88
> Selected Move:	6600	4	4	15	25000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  0  0  1  2  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 140 #######################


> Neighbours evaluated; 82
> Selected Move:	6578	4	15	14	25100


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  0  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 141 #######################


> Neighbours evaluated; 96
> Selected Move:	6550	3	15	11	24100


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 142 #######################


> Neighbours evaluated; 72
> Selected Move:	6560	3	3	18	24100


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 143 #######################


> Neighbours evaluated; 58
> Selected Move:	6560	4	14	4	23300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 144 #######################


> Neighbours evaluated; 60
> Selected Move:	6560	4	4	16	22500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 145 #######################


> Neighbours evaluated; 64
> Selected Move:	6603	1	-1	19	27500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 146 #######################


> Neighbours evaluated; 104
> Selected Move:	6800	3	18	15	26000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 147 #######################


> Neighbours evaluated; 75
> Selected Move:	6760	3	15	9	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  1  0  1  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 148 #######################


> Neighbours evaluated; 72
> Selected Move:	6790	3	11	5	26000


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  1  0  0  0  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 149 #######################


> Neighbours evaluated; 81
> Selected Move:	6885	3	16	18	26000


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  1  0  0  0  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 150 #######################


> Neighbours evaluated; 73
> Selected Move:	6736	4	18	4	26800


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 151 #######################


> Neighbours evaluated; 59
> Selected Move:	6882	3	5	11	25800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  1  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 152 #######################


> Neighbours evaluated; 51
> Selected Move:	6918	3	9	15	26800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 153 #######################


> Neighbours evaluated; 56
> Selected Move:	6837	3	15	12	26300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 154 #######################


> Neighbours evaluated; 67
> Selected Move:	6780	3	11	15	27300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  0  1  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 155 #######################


> Neighbours evaluated; 68
> Selected Move:	6878	3	4	0	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 156 #######################


> Neighbours evaluated; 35
> Selected Move:	6880	3	15	4	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 157 #######################


> Neighbours evaluated; 100
> Selected Move:	6875	3	19	15	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 158 #######################


> Neighbours evaluated; 102
> Selected Move:	6870	3	18	16	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 159 #######################


> Neighbours evaluated; 117
> Selected Move:	6750	3	15	9	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 160 #######################


> Neighbours evaluated; 112
> Selected Move:	6950	3	12	18	27000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 161 #######################


> Neighbours evaluated; 92
> Selected Move:	6750	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 162 #######################


> Neighbours evaluated; 108
> Selected Move:	6750	3	18	19	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 163 #######################


> Neighbours evaluated; 104
> Selected Move:	6894	3	2	18	25800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 164 #######################


> Neighbours evaluated; 81
> Selected Move:	6815	4	18	4	26100


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  0  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 165 #######################


> Neighbours evaluated; 87
> Selected Move:	6697	3	14	11	25600


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 166 #######################


> Neighbours evaluated; 52
> Selected Move:	6772	4	4	18	25300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 167 #######################


> Neighbours evaluated; 72
> Selected Move:	6658	3	9	14	25800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 168 #######################


> Neighbours evaluated; 64
> Selected Move:	6650	3	18	2	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 169 #######################


> Neighbours evaluated; 108
> Selected Move:	6653	3	12	16	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 170 #######################


> Neighbours evaluated; 88
> Selected Move:	6670	3	11	17	26500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 171 #######################


> Neighbours evaluated; 122
> Selected Move:	6663	3	16	18	26500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 172 #######################


> Neighbours evaluated; 91
> Selected Move:	6600	3	17	7	27000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 173 #######################


> Neighbours evaluated; 85
> Selected Move:	6550	2	14	-1	22500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 174 #######################


> Neighbours evaluated; 101
> Selected Move:	6530	3	7	9	21000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 175 #######################


> Neighbours evaluated; 97
> Selected Move:	6788	1	-1	10	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 176 #######################


> Neighbours evaluated; 86
> Selected Move:	6650	3	10	15	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 177 #######################


> Neighbours evaluated; 80
> Selected Move:	6665	3	18	16	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 178 #######################


> Neighbours evaluated; 87
> Selected Move:	6600	2	15	-1	21000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 179 #######################


> Neighbours evaluated; 96
> Selected Move:	6710	3	19	18	22500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 180 #######################


> Neighbours evaluated; 92
> Selected Move:	6690	3	9	17	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 181 #######################


> Neighbours evaluated; 118
> Selected Move:	6470	3	17	7	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 182 #######################


> Neighbours evaluated; 93
> Selected Move:	6460	3	18	19	22500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 183 #######################


> Neighbours evaluated; 101
> Selected Move:	6480	1	-1	14	27000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 184 #######################


> Neighbours evaluated; 88
> Selected Move:	6570	3	7	15	26500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 185 #######################


> Neighbours evaluated; 84
> Selected Move:	6553	3	14	12	26500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 186 #######################


> Neighbours evaluated; 98
> Selected Move:	6555	3	15	9	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 187 #######################


> Neighbours evaluated; 106
> Selected Move:	6530	3	16	10	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 188 #######################


> Neighbours evaluated; 100
> Selected Move:	6606	3	2	18	25800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 189 #######################


> Neighbours evaluated; 62
> Selected Move:	6525	3	10	15	26300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 190 #######################


> Neighbours evaluated; 62
> Selected Move:	6498	3	19	14	25800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 191 #######################


> Neighbours evaluated; 85
> Selected Move:	6550	3	15	11	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 192 #######################


> Neighbours evaluated; 71
> Selected Move:	6585	3	0	3	26300


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  1  0  1  1  0  1  0  0  0  4  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 193 #######################


> Neighbours evaluated; 52
> Selected Move:	6472	4	18	4	26600


> New Y[]: 
	
	 0  3  0  2  4  0  0  0  0  1  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 194 #######################


> Neighbours evaluated; 52
> Selected Move:	6514	3	3	0	25100


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 195 #######################


> Neighbours evaluated; 73
> Selected Move:	6550	3	18	19	23600


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  1  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 196 #######################


> Neighbours evaluated; 73
> Selected Move:	6879	3	1	18	25300


> New Y[]: 
	
	 2  0  0  0  4  0  0  0  0  1  0  1  1  0  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 197 #######################


> Neighbours evaluated; 77
> Selected Move:	6968	3	14	10	25300


> New Y[]: 
	
	 2  0  0  0  4  0  0  0  0  1  1  1  1  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 198 #######################


> Neighbours evaluated; 66
> Selected Move:	6624	4	4	12	26200


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  1  1  4  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 199 #######################


> Neighbours evaluated; 51
> Selected Move:	6580	4	12	19	26300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  1  1  1  0  0  0  0  0  3  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 200 #######################


> Neighbours evaluated; 55
> Selected Move:	6600	3	19	2	24200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  1  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 201 #######################


> Neighbours evaluated; 92
> Selected Move:	6720	3	9	14	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  1  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 202 #######################


> Neighbours evaluated; 93
> Selected Move:	6910	3	12	19	25200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 203 #######################


> Neighbours evaluated; 71
> Selected Move:	6739	3	18	16	25300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  1  0  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 204 #######################


> Neighbours evaluated; 81
> Selected Move:	6850	3	14	9	24800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  0  0  0  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 205 #######################


> Neighbours evaluated; 80
> Selected Move:	6760	3	10	14	24800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  0  1  0  0  1  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 206 #######################


> Neighbours evaluated; 86
> Selected Move:	6654	3	9	15	25800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 207 #######################


> Neighbours evaluated; 79
> Selected Move:	6710	3	14	10	25800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 208 #######################


> Neighbours evaluated; 72
> Selected Move:	6720	2	11	-1	21800


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  0  0  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 209 #######################


> Neighbours evaluated; 81
> Selected Move:	6730	3	19	18	23300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  0  0  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 210 #######################


> Neighbours evaluated; 76
> Selected Move:	6730	4	16	4	24500


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 211 #######################


> Neighbours evaluated; 67
> Selected Move:	6730	4	4	18	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  0  0  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 212 #######################


> Neighbours evaluated; 76
> Selected Move:	6720	3	18	19	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  0  0  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 213 #######################


> Neighbours evaluated; 76
> Selected Move:	6720	4	19	4	23000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  1  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 214 #######################


> Neighbours evaluated; 76
> Selected Move:	6720	4	4	10	24300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  3  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 215 #######################


> Neighbours evaluated; 67
> Selected Move:	6720	4	10	15	23600


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  0  0  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 216 #######################


> Neighbours evaluated; 80
> Selected Move:	6690	3	19	18	25100


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  0  0  0  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 217 #######################


> Neighbours evaluated; 69
> Selected Move:	6650	3	15	11	24700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  3  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 218 #######################


> Neighbours evaluated; 69
> Selected Move:	6660	3	16	19	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  3  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 219 #######################


> Neighbours evaluated; 73
> Selected Move:	6660	4	11	4	22000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  0  1  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 220 #######################


> Neighbours evaluated; 75
> Selected Move:	6740	1	-1	9	26000


> New Y[]: 
	
	 2  0  4  0  3  0  0  0  0  1  1  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 221 #######################


> Neighbours evaluated; 51
> Selected Move:	6670	4	4	19	26200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 222 #######################


> Neighbours evaluated; 63
> Selected Move:	6660	2	9	-1	22200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 223 #######################


> Neighbours evaluated; 77
> Selected Move:	6660	4	19	10	23300


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  3  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 224 #######################


> Neighbours evaluated; 71
> Selected Move:	6660	4	10	18	20700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 225 #######################


> Neighbours evaluated; 83
> Selected Move:	6662	1	-1	17	25700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  1  1  0  0  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 226 #######################


> Neighbours evaluated; 69
> Selected Move:	6610	3	17	7	26200


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 227 #######################


> Neighbours evaluated; 52
> Selected Move:	6594	3	7	6	26700


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 228 #######################


> Neighbours evaluated; 51
> Selected Move:	6495	3	10	14	26700


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 229 #######################


> Neighbours evaluated; 56
> Selected Move:	6660	2	6	-1	20700


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 230 #######################


> Neighbours evaluated; 81
> Selected Move:	6660	4	18	11	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  3  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 231 #######################


> Neighbours evaluated; 75
> Selected Move:	6660	4	11	19	22200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 232 #######################


> Neighbours evaluated; 80
> Selected Move:	6640	3	11	15	23200


> New Y[]: 
	
	 2  0  4  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 233 #######################


> Neighbours evaluated; 77
> Selected Move:	6650	3	0	5	24800


> New Y[]: 
	
	 0  0  4  0  1  2  0  0  0  0  0  0  0  0  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 234 #######################


> Neighbours evaluated; 58
> Selected Move:	6670	3	18	16	24800


> New Y[]: 
	
	 0  0  4  0  1  2  0  0  0  0  0  0  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 235 #######################


> Neighbours evaluated; 61
> Selected Move:	6670	4	5	4	24500


> New Y[]: 
	
	 0  0  4  0  2  1  0  0  0  0  0  0  0  0  1  1  1  0  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 236 #######################


> Neighbours evaluated; 64
> Selected Move:	6670	4	4	16	23700


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  1  2  0  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 237 #######################


> Neighbours evaluated; 67
> Selected Move:	6670	4	16	19	24200


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  1  3  0  0  2 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 238 #######################


> Neighbours evaluated; 62
> Selected Move:	6670	4	19	14	23900


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  2  1  3  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 239 #######################


> Neighbours evaluated; 68
> Selected Move:	6670	4	14	16	24100


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  3  1  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 240 #######################


> Neighbours evaluated; 64
> Selected Move:	6670	4	14	15	24100


> New Y[]: 
	
	 0  0  4  0  1  1  0  0  0  0  0  0  0  0  1  3  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 241 #######################


> Neighbours evaluated; 63
> Selected Move:	6670	4	16	4	24900


> New Y[]: 
	
	 0  0  4  0  2  1  0  0  0  0  0  0  0  0  1  3  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 242 #######################


> Neighbours evaluated; 63
> Selected Move:	6670	4	4	15	25000


> New Y[]: 
	
	 0  0  4  0  3  1  0  0  0  0  0  0  0  0  1  2  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 243 #######################


> Neighbours evaluated; 62
> Selected Move:	6670	4	15	5	24600


> New Y[]: 
	
	 0  0  4  0  3  2  0  0  0  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 244 #######################


> Neighbours evaluated; 66
> Selected Move:	6650	3	16	18	24600


> New Y[]: 
	
	 0  0  4  0  3  2  0  0  0  0  0  0  0  0  1  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295
________________________________________________________________

Best solution found: 7120
Run Termination time: 03.02.2010 21:30:11
Run duration: 00:03:20.4375000
________________________________________________________________
